Listing 1 - 10 of 23 | << page >> |
Sort by
|
Choose an application
A natural sequel to the author's previous book Combinatorial Matrix Theory written with H. J. Ryser, this is the first book devoted exclusively to existence questions, constructive algorithms, enumeration questions, and other properties concerning classes of matrices of combinatorial significance. Several classes of matrices are thoroughly developed including the classes of matrices of 0's and 1's with a specified number of 1's in each row and column (equivalently, bipartite graphs with a specified degree sequence), symmetric matrices in such classes (equivalently, graphs with a specified degree sequence), tournament matrices with a specified number of 1's in each row (equivalently, tournaments with a specified score sequence), nonnegative matrices with specified row and column sums, and doubly stochastic matrices. Most of this material is presented for the first time in book format and the chapter on doubly stochastic matrices provides the most complete development of the topic to date.
Combinatorial analysis --- Matrices --- Analyse combinatoire --- Combinatorial analysis. --- Matrices. --- Algebra, Matrix --- Cracovians (Mathematics) --- Matrix algebra --- Matrixes (Algebra) --- Algebra, Abstract --- Algebra, Universal --- Combinatorics --- Algebra --- Mathematical analysis
Choose an application
Simplex geometry is a topic generalizing geometry of the triangle and tetrahedron. The appropriate tool for its study is matrix theory, but applications usually involve solving huge systems of linear equations or eigenvalue problems, and geometry can help in visualizing the behaviour of the problem. In many cases, solving such systems may depend more on the distribution of non-zero coefficients than on their values, so graph theory is also useful. The author has discovered a method that in many (symmetric) cases helps to split huge systems into smaller parts. Many readers will welcome this book, from undergraduates to specialists in mathematics, as well as non-specialists who only use mathematics occasionally, and anyone who enjoys geometric theorems. It acquaints the reader with basic matrix theory, graph theory and elementary Euclidean geometry so that they too can appreciate the underlying connections between these various areas of mathematics and computer science.
Geometry --- Matrices --- Graphic methods --- Geometry. --- Matrices. --- Graphic methods. --- Graphics --- Graphs --- Geometrical drawing --- Least squares --- Mathematics --- Mechanical drawing --- Algebra, Matrix --- Cracovians (Mathematics) --- Matrix algebra --- Matrixes (Algebra) --- Algebra, Abstract --- Algebra, Universal --- Euclid's Elements
Choose an application
Preconditioning techniques have emerged as an essential part of successful and efficient iterative solutions of matrices. Ke Chen's book offers a comprehensive introduction to these methods. A vast range of explicit and implicit sparse preconditioners are covered, including the conjugate gradient, multi-level and fast multi-pole methods, matrix and operator splitting, fast Fourier and wavelet transforms, incomplete LU and domain decomposition, Schur complements and approximate inverses. In addition, aspects of parallel realization using the MPI are discussed. Very much a users-guide, the book provides insight to the use of these techniques in areas such as acoustic wave scattering, image restoration and bifurcation problems in electrical power stations. Supporting MATLAB files are available from the Web to support and develop readers' understanding, and provide stimulus for further study. Pitched at graduate level, the book is intended to serve as a useful guide and reference for students, computational practitioners, engineers and researchers alike.
Matrices --- Differential equations --- Iterative methods (Mathematics) --- Integral equations --- Sparse matrices --- Equations différentielles --- Itération (Mathématiques) --- Equations intégrales --- Matrices éparses --- Numerical solutions --- Data processing --- Solutions numériques --- Informatique --- data processing --- Spare matrix techniques --- Equations, Integral --- Functional equations --- Functional analysis --- Iteration (Mathematics) --- Numerical analysis --- Data processing. --- 517.91 Differential equations --- Equations différentielles --- Itération (Mathématiques) --- Equations intégrales --- Matrices éparses --- Solutions numériques --- 517.91 --- Numerical solutions&delete& --- Sparse matrices - data processing --- Differential equations - Numerical solutions - Data processing --- Iterative methods (Mathematics) - Data processing --- Integral equations - Numerical solutions - Data processing
Choose an application
Sparse matrices
Numerical analysis --- Sparse matrices. --- Matrices éparses. --- Analyse numérique. --- Algèbre linéaire. --- Algebras, Linear --- Matrices --- Algebra, Universal. --- Data processing. --- Data processing --- 519.6 --- 681.3*G13 --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Computational mathematics. Numerical analysis. Computer programming --- Algebra, Multiple --- Multiple algebra --- N-way algebra --- Universal algebra --- Algebra, Abstract --- Numbers, Complex --- Analyse numérique --- Algèbre linéaire --- Numerical analysis. --- Algebras, Linear. --- Matrices - Data processing --- Calcul matriciel --- Methodes numeriques
Choose an application
First published by Cambridge University Press in 1985, this series of Encyclopedia volumes attempts to present the factual body of all mathematics. Clarity of exposition and accessibility to the non-specialist were an important consideration in its design and language. The development of the algebraic aspects of angular momentum theory and the relationship between angular momentum theory and special topics in physics and mathematics are covered in this volume.
Racah algebra. --- Quantum theory. --- Quantum dynamics --- Quantum mechanics --- Quantum physics --- Physics --- Mechanics --- Thermodynamics --- Algebra, Racah --- Angular momentum --- Matrices --- Representations of groups --- Racah algebra --- Quantum theory
Choose an application
Whilst it is a moot point amongst researchers, linear algebra is an important component in the study of graphs. This book illustrates the elegance and power of matrix techniques in the study of graphs by means of several results, both classical and recent. The emphasis on matrix techniques is greater than other standard references on algebraic graph theory, and the important matrices associated with graphs such as incidence, adjacency and Laplacian matrices are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration, and the inclusion of exercises enables practical learning throughout the book. It may also be applied to a selection of sub-disciplines within science and engineering. Whilst this book will be invaluable to students and researchers in graph theory and combinatorial matrix theory who want to be acquainted with matrix theoretic ideas used in graph theory, it will also benefit a wider, cross-disciplinary readership.
Mathematics. --- Linear and Multilinear Algebras, Matrix Theory. --- Matrix theory. --- Mathématiques --- Graph theory --- Matrices --- Graph theory. --- Matrices. --- Graphentheorie. --- Electronic books. -- local. --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Algebra, Matrix --- Cracovians (Mathematics) --- Matrix algebra --- Matrixes (Algebra) --- Graphs, Theory of --- Theory of graphs --- Extremal problems --- Algebra. --- Mathematical analysis --- Math --- Science --- Algebra, Abstract --- Algebra, Universal --- Combinatorial analysis --- Topology
Choose an application
Here is an overview of modern computational stabilization methods for linear inversion, with applications to a variety of problems in audio processing, medical imaging, seismology, astronomy, and other areas. Rank-deficient problems involve matrices that are exactly or nearly rank deficient. Such problems often arise in connection with noise suppression and other problems where the goal is to suppress unwanted disturbances of given measurements. Discrete ill-posed problems arise in connection with the numerical treatment of inverse problems, where one typically wants to compute information about interior properties using exterior measurements. Examples of inverse problems are image restoration and tomography, where one needs to improve blurred images or reconstruct pictures from raw data. This book describes new and existing numerical methods for the analysis and solution of rank-deficient and discrete ill-posed problems. The emphasis is on insight into the stabilizing properties of the algorithms and the efficiency and reliability of the computations.
Equations, Simultaneous --- Iterative methods (Mathematics) --- Sparse matrices. --- Itération (Mathématiques) --- Matrices éparses --- Numerical solutions. --- 519.6 --- 681.3*G13 --- 517.95 --- #TELE:SISTA --- 681.3*G15 --- Computational mathematics. Numerical analysis. Computer programming --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Partial differential equations --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 517.95 Partial differential equations --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Iterative methods (Mathematics). --- Itération (Mathématiques) --- Matrices éparses --- Sparse matrices --- Spare matrix techniques --- Matrices --- Iteration (Mathematics) --- Numerical analysis --- Numerical solutions --- Equations, Simultaneous - Numerical solutions.
Choose an application
Mathematical statistics --- Multivariate analysis. --- Analyse multivariée --- Multivariate analysis --- 519.2 --- Multivariate distributions --- Multivariate statistical analysis --- Statistical analysis, Multivariate --- Analysis of variance --- Matrices --- Probability. Mathematical statistics --- 519.2 Probability. Mathematical statistics --- Analyse multivariée
Choose an application
Medical statistics --- Medicine --- Multivariate analysis --- maatschappijwetenschappen, methoden --- Multivariate distributions --- Multivariate statistical analysis --- Statistical analysis, Multivariate --- Analysis of variance --- Mathematical statistics --- Matrices --- Health Workforce --- Health --- Health statistics --- Statistics --- Research&delete& --- Methodology --- Statistical methods --- Research
Choose an application
In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank
Control theory. --- Mathematical optimization. --- Matrices. --- Théorie de la commande --- Optimisation mathématique --- Matrices --- Control theory --- Mathematical optimization --- Théorie de la commande --- Optimisation mathématique --- EPUB-LIV-FT ELSEVIER-B --- Programming (Mathematics) --- Programmation (mathématiques) --- Algebra, Matrix --- Cracovians (Mathematics) --- Matrix algebra --- Matrixes (Algebra) --- Algebra, Abstract --- Algebra, Universal --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Dynamics --- Machine theory --- Programmation (mathématiques) --- Theorie du controle --- Theorie des systemes --- Programmation mathematique --- Systemes lineaires --- Controle stochastique --- Programmation lineaire
Listing 1 - 10 of 23 | << page >> |
Sort by
|